Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

b(a(b(a(c(b(a(x1))))))) → a(b(a(c(b(b(a(b(a(c(x1))))))))))

Q is empty.


QTRS
  ↳ RFCMatchBoundsTRSProof

Q restricted rewrite system:
The TRS R consists of the following rules:

b(a(b(a(c(b(a(x1))))))) → a(b(a(c(b(b(a(b(a(c(x1))))))))))

Q is empty.

Termination of the TRS R could be shown with a Match Bound [6,7] of 2. This implies Q-termination of R.
The following rules were used to construct the certificate:

b(a(b(a(c(b(a(x1))))))) → a(b(a(c(b(b(a(b(a(c(x1))))))))))

The certificate found is represented by the following graph.

The certificate consists of the following enumerated nodes:

1, 2, 11, 5, 6, 9, 10, 7, 8, 3, 4, 20, 14, 15, 18, 19, 16, 17, 12, 13, 29, 23, 24, 27, 28, 25, 26, 21, 22, 38, 32, 33, 36, 37, 34, 35, 30, 31, 47, 41, 42, 45, 46, 43, 44, 39, 40

Node 1 is start node and node 2 is final node.

Those nodes are connect through the following edges: